package com.hailintang.demo.template.BFS;

public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;
        TreeNode(int x) {
            val = x;
        }

    public TreeNode[] adj() {
            //获取相邻节点
        return new TreeNode[0];
    }
}